…oming token graphs with holes (apache#157)

6 main improvements:
    1) Iterate through all output.InputNodes since dest gaps can exist.
    2) freeBefore the minimum input node instead of the first input node(which was usually, but not always, the minimum).
    3) Don't freeBefore from a hole source node. Book keeping may not be correct and could result in an early free.
    4) When adding an output node after hole recovery, calculate its new position increment instead of adding it to the end of the output graph.
    5) Nodes after holes that have edges to their source will do the output re-mapping that the deleted node would have done.
    6) If a disconnected input node swaps order with another node in the output, then map them to the same output node.

…oming token graphs with holes (apache#157)

6 main improvements:
    1) Iterate through all output.InputNodes since dest gaps can exist.
    2) freeBefore the minimum input node instead of the first input node(which was usually, but not always, the minimum).
    3) Don't freeBefore from a hole source node. Book keeping may not be correct and could result in an early free.
    4) When adding an output node after hole recovery, calculate its new position increment instead of adding it to the end of the output graph.
    5) Nodes after holes that have edges to their source will do the output re-mapping that the deleted node would have done.
    6) If a disconnected input node swaps order with another node in the output, then map them to the same output node.

…oming token graphs with holes (apache#157)

6 main improvements:
    1) Iterate through all output.InputNodes since dest gaps can exist.
    2) freeBefore the minimum input node instead of the first input node(which was usually, but not always, the minimum).
    3) Don't freeBefore from a hole source node. Book keeping may not be correct and could result in an early free.
    4) When adding an output node after hole recovery, calculate its new position increment instead of adding it to the end of the output graph.
    5) Nodes after holes that have edges to their source will do the output re-mapping that the deleted node would have done.
    6) If a disconnected input node swaps order with another node in the output, then map them to the same output node.

…oming token graphs with holes (apache#157)

6 main improvements:
    1) Iterate through all output.InputNodes since dest gaps can exist.
    2) freeBefore the minimum input node instead of the first input node(which was usually, but not always, the minimum).
    3) Don't freeBefore from a hole source node. Book keeping may not be correct and could result in an early free.
    4) When adding an output node after hole recovery, calculate its new position increment instead of adding it to the end of the output graph.
    5) Nodes after holes that have edges to their source will do the output re-mapping that the deleted node would have done.
    6) If a disconnected input node swaps order with another node in the output, then map them to the same output node.

…oming token graphs with holes (apache#157)

6 main improvements:
    1) Iterate through all output.InputNodes since dest gaps can exist.
    2) freeBefore the minimum input node instead of the first input node(which was usually, but not always, the minimum).
    3) Don't freeBefore from a hole source node. Book keeping may not be correct and could result in an early free.
    4) When adding an output node after hole recovery, calculate its new position increment instead of adding it to the end of the output graph.
    5) Nodes after holes that have edges to their source will do the output re-mapping that the deleted node would have done.
    6) If a disconnected input node swaps order with another node in the output, then map them to the same output node.

…oming token graphs with holes (apache#157)

 6 main improvements:
     1) Iterate through all output.InputNodes since dest gaps can exist.
     2) freeBefore the minimum input node instead of the first input node(which was usually, but not always, the minimum).
     3) Don't freeBefore from a hole source node. Book keeping may not be correct and could result in an early free.
     4) When adding an output node after hole recovery, calculate its new position increment instead of adding it to the end of the output graph.
     5) Nodes after holes that have edges to their source will do the output re-mapping that the deleted node would have done.
     6) If a disconnected input node swaps order with another node in the output, then map them to the same output node.

…oming token graphs with holes (apache#157)

 6 main improvements:
     1) Iterate through all output.InputNodes since dest gaps can exist.
     2) freeBefore the minimum input node instead of the first input node(which was usually, but not always, the minimum).
     3) Don't freeBefore from a hole source node. Book keeping may not be correct and could result in an early free.
     4) When adding an output node after hole recovery, calculate its new position increment instead of adding it to the end of the output graph.
     5) Nodes after holes that have edges to their source will do the output re-mapping that the deleted node would have done.
     6) If a disconnected input node swaps order with another node in the output, then map them to the same output node.